Ontology: 
C1 ⊑ C2
C1 ⊑ ∃R1
∃R2 ⊑ C3
∃R3 ⊑ ∃R4
R5 ⊑ R6
C1(a)
C1(b)
R2(c, d)
R3(e, f)
R5(g, h)


Logical Implications:
C2(a)
R1(b, _)
C3(c)
R4(e, _)
R6(g, h)


(
C1 ⊑ C2, C1(a) → C2(a)
C1 ⊑ ∃R1, C1(b) → R1(b, _)
∃R2 ⊑ C3, R2(c, d) → C3(c)
∃R3 ⊑ ∃R4, R3(e, f) → R4(e, _)
R5 ⊑ R6, R5(g, h) → R6(e, _)
)



results:
LLaMA-NI: R1(b, _) No
LLaMA-WI: R1(b, _) No
